Characterizing Causal Action Theories and Their Implementations in Answer Set Programming: Action Languages B, C, and Beyond
نویسندگان
چکیده
We consider a simple language for writing causal action theories, and postulate several properties for the state transition models of these theories. We then consider some possible embeddings of these causal action theories in some other action formalisms, and their implementations in logic programs with answer set semantics. In particular, we propose to consider what we call permissible translations from these causal action theories to logic programs. We identify two sets of properties, and prove that for each set, there is only one permissible translation, under strong equivalence, that can satisfy all properties in the set. As it turns out, for one set, the unique permissible translation is essentially the same as Balduccini and Gelfond’s translation from Gelfond and Lifschitz’s action language B to logic programs. For the other, it is essentially the same as Lifschitz and Turner’s translation from the action language C to logic programs. This work provides a new perspective on understanding, evaluating and comparing action languages by using sets of properties instead of examples. It will be interesting to see if other action languages can be similarly characterized, and whether new action formalisms can be defined using different sets of properties.
منابع مشابه
Representing Actions in Logic-based Languages
We investigate using logic programming, causal theories and action languages to describe effects of actions and reason about dynamic domains. This includes characterizing first-order causal theory by functional completion, characterizing first-order stable models by Lloyd-Topor completion, representing causal theories in logic programming and describing dynamic domains in the new action languag...
متن کاملAction Languages, Answer Sets and Planning
This is a discussion of some of the achievements and challenges related to representing actions and the design of planners from the perspective of logic programming. We talk about recent work on action languages and translating them into logic programming, on representing possible histories of an action domain by answer sets, on eecient implementations of the answer set semantics and their use ...
متن کاملTranslating First-Order Causal Theories into Answer Set Programming
Nonmonotonic causal logic became a basis for the semantics of several expressive action languages. Norman McCain and Paolo Ferraris showed how to embed propositional causal theories into logic programming, and this work paved the way to the use of answer set solvers for answering queries about actions described in causal logic. In this paper we generalize these embeddings to first-order causal ...
متن کاملRepresenting first-order causal theories by logic programs
Nonmonotonic causal logic, introduced by Norman McCain and Hudson Turner, became a basis for the semantics of several expressive action languages. McCain’s embedding of definite propositional causal theories into logic programming paved the way to the use of answer set solvers for answering queries about actions described in such languages. In this paper we extend this embedding to nondefinite ...
متن کاملExtending Action Language C+ by Formalizing Composite Actions
This paper extends action language C+ by introducing composite actions as sequential execution of primitive actions. Such extension leads to a more intuitive and flexible way to represent action domains, better exploit a general-purpose formalization, and improve the reasoning efficiency for large domains. The semantics of composite actions is defined by a translation to nonmonotonic causal the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Artif. Intell.
دوره 248 شماره
صفحات -
تاریخ انتشار 2015